n = int(input())
arr = list(map(lambda x: int(x), input().split()))
arr.reverse()
m = arr[0]
arr[0] = 0
for i in range(1,n):
if arr[i]<=m:
arr[i] = m - arr[i] + 1
else:
m = arr[i]
arr[i]=0
arr.reverse()
for i in range(n):
print(arr[i], end = " ")
print(" ")
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,temp;
cin>>n;
int a[n],b[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int max=0;
for(int i=n-1;i>=0;i--)
{
if(a[i]>max)
{
b[i]=0;
max=a[i];
}
else if(a[i]==max)
b[i]=1;
else
b[i]=max-a[i]+1;
}
for(int i=0;i<n;i++)
cout<<b[i]<<" ";
cout<<endl;
}921. Minimum Add to Make Parentheses Valid | 881. Boats to Save People |
497. Random Point in Non-overlapping Rectangles | 528. Random Pick with Weight |
470. Implement Rand10() Using Rand7() | 866. Prime Palindrome |
1516A - Tit for Tat | 622. Design Circular Queue |
814. Binary Tree Pruning | 791. Custom Sort String |
787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |